Convex Optimization for the Densest Subgraph and Densest Submatrix Problems
نویسندگان
چکیده
منابع مشابه
Robust convex relaxation for the planted clique and densest k-subgraph problems
We consider the problem of identifying the densest k-node subgraph in a given graph. We write this problem as an instance of rank-constrained cardinality minimization and then relax using the nuclear and `1 norms. Although the original combinatorial problem is NP-hard, we show that the densest k-subgraph can be recovered from the solution of our convex relaxation for certain program inputs. In ...
متن کاملDensest Subgraphs THE DENSE K SUBGRAPH PROBLEM
Given a graph G = (V, E) and a parameter k, we consider the problem of finding a subset U ⊆ V of size k that maximizes the number of induced edges (DkS). We improve upon the previously best known approximation ratio for DkS, a ratio that has not seen any progress during the last decade. Specifically, we improve the approximation ratio from n to n. The improved ratio is obtained by studying a va...
متن کاملDensest Subgraph in Streaming and MapReduce
The problem of finding locally dense components of a graph is an important primitive in data analysis, with wide-ranging applications from community mining to spam detection and the discovery of biological network modules. In this paper we present new algorithms for finding the densest subgraph in the streaming model. For any > 0, our algorithms make O(log1+ n) passes over the input and find a ...
متن کاملOn the densest k-subgraph problem
Given an n-vertex graph G and a parameter k, we are to nd a k-vertex subgraph with the maximum number of edges. This problem is N P-hard. We show that the problem remains N P-hard even when the maximum degree in G is three. When G contains a k-clique, we give an algorithm that for any > 0 nds a k-vertex subgraph with at least (1 ?) ? k 2 edges, in time n O((1+log n k)==). We study the applicabi...
متن کاملDensest k-Subgraph Approximation on Intersection Graphs
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of σ-quasi elimination orders, introduced by Akcoglu et al. [?], generalizing the perfect elimination orders for chordal graphs, and develop a simple O(σ)-approximation technique for graphs admitting such a vertex order. This concept allows us to derive cons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SN Operations Research Forum
سال: 2020
ISSN: 2662-2556
DOI: 10.1007/s43069-020-00020-5